RETRIAL QUEUEING SYSTEM WITH COLLISION AND IMPATIENCE
نویسندگان
چکیده
منابع مشابه
Retrial Queueing System with Several Input Flows
type i, , K , 1 i = who finds the server free begins to get service inmediately and leaves the system after completion. Otherwise, if the server is busy, the customer with probability 1 Hi leaves the system without service and with probability Hi > 0 joins an orbit of repeated customer but conserves its own type. The intervals separating two succesive repeated attempts of each customers from th...
متن کاملA Discrete-Time Retrial Queueing System With Service Upgrade
This paper considers a discrete-time retrial queueing system with displacements. The arriving customers can opt to go directly to the server obtaining immediately its service or to join the orbit. In the first case, the displaced customer goes directly to the orbit. The arrivals follow a geometrical law and the service times are general. We study the Markov chain underlying the considered queue...
متن کاملEfficient Method to Approximately Solve Retrial Systems with Impatience
We present a novel technique to solve multiserver retrial systems with impatience. Unfortunately these systems do not present an exact analytic solution, so it is mandatory to resort to approximate techniques. This novel technique does not rely on the numerical solution of the steady-state Kolmogorov equations of the Continuous Time Markov Chain as it is common for this kind of systems but it c...
متن کاملOn the BMAP_1, BMAP_2/PH/g, c retrial queueing system
In this paper, we analyze a retrial queueing system with Batch Markovian Arrival Processes and two types of customers. The rate of individual repeated attempts from the orbit is modulated according to a Markov Modulated Poisson Process. Using the theory of multi-dimensional asymptotically quasi-Toeplitz Markov chain, we obtain the stability condition and the algorithm for calculating the statio...
متن کاملConditions for stability and instability of retrial queueing systems with general retrial times
We study the stability of single server retrial queues under general distribution for retrial times and stationary ergodic service times, for three main retrial policies studied in the literature: classical linear, constant and control policies. The approach used is the renovating events approach to obtain sufficient stability conditions by strong coupling convergence of the process modeling th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the Korean Mathematical Society
سال: 2010
ISSN: 1225-1763
DOI: 10.4134/ckms.2010.25.4.647